On Solutions for the Maximum Revenue Multi-item Auction under Dominant-Strategy and Bayesian Implementations
نویسنده
چکیده
Very few exact solutions are known for the monopolist’s k-item n-buyer maximum revenue problem with additive valuation in which k, n > 1 and the buyers i have independent private distributions F j i on items j. In this paper we derive exact formulas for the maximum revenue when k = 2 and F j i are any IID distributions on support of size 2, for both the dominant-strategy (DIC) and the Bayesian (BIC) implementations. The formulas lead to the simple characterization that, the two implementations have identical maximum revenue if and only if selling-separately is optimal for the distribution. Our results also give the first demonstration, in this setting, of revenue gaps between the two implementations. For instance, if k = n = 2 and Pr{XF = 1} = Pr{XF = 2} = 1 2 , then the maximum revenue in the Bayesian implementation exceeds that in the dominant-strategy by exactly 2%; the same gap exists for the continuous uniform distribution XF over [a, a+ 1] ∪ [2a, 2a+ 1] for all large a. Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing. This work was supported in part by the Danish National Research Foundation and the National Natural Science Foundation of China (under grant NSFC 61361136003). 1
منابع مشابه
Generalizing Virtual Values to Multidimensional Auctions: a Non-Myersonian Approach
We consider the revenue maximization problem of a monopolist via a non-Myersonian approach that could generalize to multiple items and multiple buyers. Although such an approach does not lead to any closed-form solution of the problem, it does provide some insights to this problem from different angles. In particular, we consider both Bayesian (Bayesian Incentive Compatible + Bayesian Individua...
متن کاملAn n-to-1 Bidder Reduction for Multi-item Auctions and its Applications
In this paper, we introduce a novel approach for reducing the k-item n-bidder auction with additive valuation to k-item 1-bidder auctions. This approach, called the Best-Guess reduction, can be applied to address several central questions in optimal revenue auction theory such as the power of randomization, and Bayesian versus dominant-strategy implementations. First, when the items have indepe...
متن کاملThe Value of Information Concealment
We consider a revenue optimizing seller selling a single item to a buyer, on whose private value the seller has a noisy signal. We show that, when the signal is kept private, arbitrarily more revenue could potentially be extracted than if the signal is leaked or revealed. We then show that, if the seller is not allowed to make payments to the buyer, the gap between the two is bounded by a multi...
متن کاملOn the Foundations of Ex Post Incentive Compatible Mechanisms
Motivation. The recent literature on mechanism design provides a series of studies on robustness issues, motivated by the idea that a desirable mechanism should not rely too heavily on the agents’ common knowledge structure (Wilson, 1985). One approach is to adopt stronger solution concepts that are insensitive to various common knowledge assumptions, such as dominant-strategy incentive compati...
متن کاملIroning the Border: Optimal Auctions for Negatively Correlated Items
We consider the problem of designing revenue-optimal auctions for selling two items and bidders’ valuations are independent among bidders but negatively correlated among items. Abstractly, this setting can be thought of as an instance with single-dimensional type space but multi-dimensional allocation space. Such setting has been extensively studied in the literature, but all under the assumpti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1607.03685 شماره
صفحات -
تاریخ انتشار 2016